A first–passage time random walk distribution with five transition probabilities: a generalization of the shifted inverse trinomial
نویسندگان
چکیده
In this paper a univariate discrete distribution, denoted by GIT, is proposed as a generalization of the shifted inverse trinomial distribution, and is formulated as a first-passage time distribution of amodified randomwalk on the half-plane with five transition probabilities. In contrast, the inverse trinomial arises as a random walk on the real line with three transition probabilities. The probability mass function (pmf) is expressible in terms of the Gauss hypergeometric function and this offers computational advantage due to its recurrence formula. The descending factorial moment is also obtained. The GIT contains twenty-two possible distributions in total. Special cases include the binomial, negative binomial, shifted negative binomial, shifted inverse binomial or, equivalently, lost-games, and shifted inverse trinomial distributions.A subclassGIT3,1 is a particular member of Kemp’s class of convolution of pseudo-binomial variables and its properties such as reproductivity, formulation, pmf, moments, index of dispersion, and approximations are studied in detail. Compound or generalized (stopped sum) distributions provide inflated models. The inflated GIT3,1 extends Minkova’s inflated-parameter binomial and negative binomial. Abivariatemodel which has theGIT as amarginal distribution is also proposed. K. Aoyama School of Fundamental Science and Technology, Keio University, Yokohama 223-8522, Japan e-mail: [email protected] K. Shimizu (B) Department of Mathematics, Keio University, Yokohama 223-8522, Japan e-mail: [email protected] S. H. Ong Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur, Malaysia e-mail: [email protected]
منابع مشابه
Uniform Markov Renewal Theory and Ruin Probabilities in Markov Random Walks
Let {Xn, n≥ 0} be a Markov chain on a general state space X with transition probability P and stationary probability π. Suppose an additive component Sn takes values in the real line R and is adjoined to the chain such that {(Xn, Sn), n≥ 0} is a Markov random walk. In this paper, we prove a uniform Markov renewal theorem with an estimate on the rate of convergence. This result is applied to bou...
متن کاملFirst Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملRare-event Simulation for Multidimensional Regularly Varying Random Walks
We consider the problem of e¢ cient estimation via simulation of rst passage time probabilities for a multidimensional random walk with regularly varying increments. In addition of being a natural generalization of the problem of computing ruin probabilities in insurance in which the focus is a one dimensional random walk this problem captures important features of large deviations for multi...
متن کاملThe Cover Time of Deterministic Random Walks for General Transition Probabilities
Abstract. The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk, nothing is known about the cover time of deterministic random walks emulating general transition probabilities. This paper is concerned with the SRT-rou...
متن کاملOn the first passage time of a simple random walk on a tree
We consider a simple random walk on a tree. Exact expressions are obtained for the expectation and the variance of the first passage time, thereby recovering the known result that these are integers. A relationship of the mean first passage matrix with the distance matrix is established and used to derive a formula for the inverse of the mean first passage matrix.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008